The combinatorics of resource sharing

We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms and deadlock-handling policies, and concurrency issues. These structures are mostly graph-theoretic in nature, or partially ordered sets for the establishment of priorities among processes and acquisition orders on resources. We also discuss graph-coloring concepts as they relate to resource sharing.Comment: R. Correa et alii (eds.), Models for Parallel and Distributed Computation, pp. 27-52. Kluwer Academic Publishers, Dordrecht, The Netherlands, 200

Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs

Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, then the traditional BFS (Cooper-Marzullo and its variants) requires $\mathcal{O}(\frac{m^{n-1}}{n})$ space in the worst case, whereas ou r algorithm performs the BFS requires $\mathcal{O}(m^2n^2)$ space. Thus, we reduce the space complexity for BFS enumeration of consistent global states exponentially. and give the first polynomial space algorithm for this task. In our experimental evaluation of seven benchmarks, traditional BFS fails in many cases by exhausting the 2 GB heap space allowed to the JVM. In contrast, our implementation uses less than 60 MB memory and is also faster in many cases

Ptolemy-HLA: A Cyber-Physical System Distributed Simulation Framework

The Ptolemy-HLA distributed co-simulation framework leverages two open source tools, Ptolemy II and HLA/CERTI, for the simulation of Cyber-Physical Systems (CPS). This framework enables dealing with three important issues: (1) Distribution of a simulation, allowing to scale up models and performance; (2) Interoperability of tools, allowing reusability and interfacing with other simulators or real devices/systems; (3) Heterogeneous simulations (discrete events, continuous time). The framework extends Ptolemy both, by coordinating the time advance of various Ptolemy instances, and by allowing data communication between them with the help of HLA management services. These additions enable the creation of HLA federates (i.e., simulators) in a Federation (i.e., a distributed simulation) in an easy way, since the user does not need to be an HLA specialist in order to design a Federate. The paper presents the new components added to Ptolemy, some semantic issues, an application example and performance analysis

On the Use of Iterative Approximations in Queueing Networks; with Simple Applications

Networks of queues which have a productform solution can be analyzed easily by the convolution method or with mean value analysis. Regrettably, however, many practical queueing network models do not possess a productform solution. In this paper the following approach is advocated for models with alight deviations from the productform conditions: approximate the model interatively by a sequence of models which satisfy conditions for simple analysis. Quite often aggregation and mean value analysis provide the natural approach for de signing an iteration step. Applications which are mentioned are: two-phase servers where the first phase is a preparatory one; a type of priorities; blocking; many-chains networks; FCFS-servers with different workloads for different types of customers

A resource usage efficient distributed allocation algorithm for 5G Service Function Chains

International audienceRecent evolution of networks introduce new challenges for the allocation of resources. Slicing in 5G networks allows multiple users to share a common infrastructure and the chaining of Network Function (NF)s introduces constraints on the order in which NFs are allocated. We first model the allocation of resources for Chains of NFs in 5G Slices. Then we introduce a distributed mutual exclusion algorithm to address the problem of the allocation of resources. We show with selected metrics that choosing an order of allocation of the resources that differs from the order in which resources are used can give better performances. We then show experimental results where we improve the usage rate of resources by more than 20% compared to the baseline algorithm in some cases. The experiments run on our own simulator based on SimGrid

Specification of Dynamic Reconfiguration in the Context of Input/Output Relations

Abstract: Recent advances in telecommunication and software technology have mo-tivated the study of components with dynamically changing syntactic interfaces. Formal development methods are traditionally directed towards components with static inter-faces. We investigate this short-coming of formal development methods and outline how it can be overcome. We start by presenting a semantic model for interactive components communicating asynchronously by message passing. On the top of this model we build a simple specifi-cation language directed towards components with static interfaces. Then we generalise this language to handle components with dynamic interfaces. We introduce operators fo

Unique Signatures of Natural Background Radiation on Human Y Chromosomes from Kerala, India

The most frequently observed major consequences of ionizing radiation are chromosomal lesions and cancers, although the entire genome may be affected. Owing to its haploid status and absence of recombination, the human Y chromosome is an ideal candidate to be assessed for possible genetic alterations induced by ionizing radiation. We studied the human Y chromosome in 390 males from the South Indian state of Kerala, where the level of natural background radiation (NBR) is ten-fold higher than the worldwide average, and that from 790 unexposed males as control.We observed random microdeletions in the Azoospermia factor (AZF) a, b and c regions in >90%, and tandem duplication and copy number polymorphism (CNP) of 11 different Y-linked genes in about 80% of males exposed to NBR. The autosomal homologues of Y-linked CDY genes largely remained unaffected. Multiple polymorphic copies of the Y-linked genes showing single Y-specific signals suggested their tandem duplication. Some exposed males showed unilocus duplication of DAZ genes resulting in six copies. Notably, in the AZFa region, approximately 25% of exposed males showed deletion of the DBY gene, whereas flanking genes USP9Y and UTY remained unaffected. All these alterations were detected in blood samples but not in the germline (sperm) samples.Exposure to high levels of NBR correlated with several interstitial polymorphisms of the human Y chromosome. CNPs and enhanced transcription of the SRY gene after duplication are envisaged to compensate for the loss of Y chromosome in some cells. The aforesaid changes, confined to peripheral blood lymphocytes, suggest a possible innate mechanism protecting the germline DNA from the NBR. Genome analysis of a larger population focusing on greater numbers of genes may provide new insights into the mechanisms and risks of the resultant genetic damages. The present work demonstrates unique signatures of NBR on human Y chromosomes from Kerala, India

Recurrent Plasmodium falciparum Malaria Infections in Kenyan Children Diminish T-Cell Immunity to Epstein Barr Virus Lytic but Not Latent Antigens

Plasmodium falciparum malaria (Pf-malaria) and Epstein Barr Virus (EBV) infections coexist in children at risk for endemic Burkitt's lymphoma (eBL); yet studies have only glimpsed the cumulative effect of Pf-malaria on EBV-specific immunity. Using pooled EBV lytic and latent CD8+ T-cell epitope-peptides, IFN-γ ELISPOT responses were surveyed three times among children (10 months to 15 years) in Kenya from 2002–2004. Prevalence ratios (PR) and 95% confidence intervals (CI) were estimated in association with Pf-malaria exposure, defined at the district-level (Kisumu: holoendemic; Nandi: hypoendemic) and the individual-level. We observed a 46% decrease in positive EBV lytic antigen IFN-γ responses among 5–9 year olds residing in Kisumu compared to Nandi (PR: 0.54; 95% CI: 0.30–0.99). Individual-level analysis in Kisumu revealed further impairment of EBV lytic antigen responses among 5–9 year olds consistently infected with Pf-malaria compared to those never infected. There were no observed district- or individual-level differences between Pf-malaria exposure and EBV latent antigen IFN-γ response. The gradual decrease of EBV lytic antigen but not latent antigen IFN-γ responses after primary infection suggests a specific loss in immunological control over the lytic cycle in children residing in malaria holoendemic areas, further refining our understanding of eBL etiology

Selected MicroRNAs Define Cell Fate Determination of Murine Central Memory CD8 T Cells

During an immune response T cells enter memory fate determination, a program that divides them into two main populations: effector memory and central memory T cells. Since in many systems protection appears to be preferentially mediated by T cells of the central memory it is important to understand when and how fate determination takes place. To date, cell intrinsic molecular events that determine their differentiation remains unclear. MicroRNAs are a class of small, evolutionarily conserved RNA molecules that negatively regulate gene expression, causing translational repression and/or messenger RNA degradation. Here, using an in vitro system where activated CD8 T cells driven by IL-2 or IL-15 become either effector memory or central memory cells, we assessed the role of microRNAs in memory T cell fate determination. We found that fate determination to central memory T cells is under the balancing effects of a discrete number of microRNAs including miR-150, miR-155 and the let-7 family. Based on miR-150 a new target, KChIP.1 (K + channel interacting protein 1), was uncovered, which is specifically upregulated in developing central memory CD8 T cells. Our studies indicate that cell fate determination such as surface phenotype and self-renewal may be decided at the pre-effector stage on the basis of the balancing effects of a discrete number of microRNAs. These results may have implications for the development of T cell vaccines and T cell-based adoptive therapies